Knapsack problem

Results: 111



#Item
51

PDF Document

Add to Reading List

Source URL: www.mansci.ovgu.de

Language: English - Date: 2012-05-21 04:38:13
52Maejo Int. J. Sci. Technol. 2015, 9(01), Maejo International Journal of Science and Technology ISSNAvailable online at www.mijst.mju.ac.th

Maejo Int. J. Sci. Technol. 2015, 9(01), Maejo International Journal of Science and Technology ISSNAvailable online at www.mijst.mju.ac.th

Add to Reading List

Source URL: www.mijst.mju.ac.th

Language: English - Date: 2015-04-02 23:15:13
53Application of POMAC to the Multiobjective 0/1 Knapsack Problem Rié Komuro E. David Ford

Application of POMAC to the Multiobjective 0/1 Knapsack Problem Rié Komuro E. David Ford

Add to Reading List

Source URL: www.nrcse.washington.edu

Language: Vietnamese - Date: 2001-06-20 17:12:00
    54Constant Factor Approximation Algorithm for the Knapsack Median Problem Amit Kumar Abstract We give a constant factor approximation algorithm for

    Constant Factor Approximation Algorithm for the Knapsack Median Problem Amit Kumar Abstract We give a constant factor approximation algorithm for

    Add to Reading List

    Source URL: www.cse.iitd.ernet.in

    Language: English - Date: 2011-09-29 14:25:56
    55Microsoft PowerPoint - DynamicProgramming.ppt

    Microsoft PowerPoint - DynamicProgramming.ppt

    Add to Reading List

    Source URL: ww3.algorithmdesign.net

    Language: English - Date: 2005-02-24 01:47:32
    56Chapter 5: Hard Problems Quotation Algorithmic Adventures From Knowledge to Magic

    Chapter 5: Hard Problems Quotation Algorithmic Adventures From Knowledge to Magic

    Add to Reading List

    Source URL: www.win.tue.nl

    Language: English - Date: 2011-10-24 15:11:43
    57Combining Constraint Propagation and Discrete Ellipsoid-Based Search to Solve the Exact Quadratic Knapsack Problem Wen-Yang Ku and J. Christopher Beck Department of Mechanical & Industrial Engineering University of Toron

    Combining Constraint Propagation and Discrete Ellipsoid-Based Search to Solve the Exact Quadratic Knapsack Problem Wen-Yang Ku and J. Christopher Beck Department of Mechanical & Industrial Engineering University of Toron

    Add to Reading List

    Source URL: tidel.mie.utoronto.ca

    Language: English - Date: 2015-01-28 09:11:33
    58Limitations of Incremental Dynamic Programming Stasys Jukna Abstract We consider so-called “incremental” dynamic programming algorithms, and are interested in the number of subproblems produced by them. The classical

    Limitations of Incremental Dynamic Programming Stasys Jukna Abstract We consider so-called “incremental” dynamic programming algorithms, and are interested in the number of subproblems produced by them. The classical

    Add to Reading List

    Source URL: lovelace.thi.informatik.uni-frankfurt.de

    Language: English - Date: 2013-04-23 13:36:27
    59Lecture 7 Generate-Test-Aggregate in Coq - NII Lectures Series [width=4cm]niilogo.jpg

    Lecture 7 Generate-Test-Aggregate in Coq - NII Lectures Series [width=4cm]niilogo.jpg

    Add to Reading List

    Source URL: www.nii.ac.jp

    Language: English - Date: 2013-11-28 19:26:39
    60Comparison of Parallel Algorithms for the 0-1 Knapsack Problem on Networked Computers Rebecca A Hunt A Thesis in the Field of Information Technology

    Comparison of Parallel Algorithms for the 0-1 Knapsack Problem on Networked Computers Rebecca A Hunt A Thesis in the Field of Information Technology

    Add to Reading List

    Source URL: www.rebeccahunt.com

    Language: English - Date: 2005-08-27 14:17:40